منابع مشابه
Encoding and Decoding of Planar Maps through Conforming Delaunay Triangulations
This paper describes a method to represent a Planar Map (PM) through a Conforming Delaunay Triangulation (CDT) with applications in a server-client environment. At the server a CDT of the edges of the PM is determined. As the PM is now embedded by the CDT it is sufficient to send to the client the list of coordinates of the CDT nodes and an efficient encoded bitmap of the corresponding PM-CDT e...
متن کاملPerturbations for Delaunay and weighted Delaunay 3D triangulations
The Delaunay triangulation and the weighted Delaunay triangulation are not uniquely defined when the input set is degenerate. We present a new symbolic perturbation that allows to always define these triangulations in a unique way, as soon as the points are not all coplanar. No flat tetrahedron exists in the defined triangulation. The perturbation scheme is easy to code; It is implemented in cg...
متن کاملVertex Deletion for 3D Delaunay Triangulations
We show how to delete a vertex q from a three-dimensional Delaunay triangulation DT(S) in expected O(C⊗(P )) time, where P is the set of vertices neighboring q in DT(S) and C⊗(P ) is an upper bound on the expected number of tetrahedra whose circumspheres enclose q that are created during the randomized incremental construction of DT(P ). Experiments show that our approach is significantly faste...
متن کاملBoundary Conforming Delaunay Mesh Generation
Many physical phenomena can be modeled by partial differential equations which may be solved by numerical methods such as finite element and finite volume methods. In this context, a given domain must first be subdivided into many simple cells. Both the shape and size of the cells will affect the accuracy and convergence of the method. A boundary conforming Delaunay mesh is a partition of a pol...
متن کاملAdaptive Finite Element Methods for Elliptic PDEs Based on Conforming Centroidal Voronoi-Delaunay Triangulations
A new triangular mesh adaptivity algorithm for elliptic PDEs that combines a posteriori error estimation with centroidal Voronoi/Delaunay tessellations of domains in two dimensions is proposed and tested. The ability of the first ingredient to detect local regions of large error and the ability of the second ingredient to generate superior unstructured grids results in an mesh adaptivity algori...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Computational Geometry
سال: 2004
ISSN: 0925-7721
DOI: 10.1016/j.comgeo.2004.03.001